3 Prime { P 5 , P 5 , C 5 } - free graphs
نویسندگان
چکیده
We prove that a graph G contains no induced 5-vertex path and no induced complement of a 5-vertex path if and only if G is obtained from 5-cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement (where split unification is a new class-preserving operation that is introduced in this paper).
منابع مشابه
Pentavalent symmetric graphs of order 2pq
A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, a complete classification of connected pentavalent symmetric graphs of order 12p is given for each prime p. As a result, a connected pentavalent symmetric graph of order 12p exists if and only if p = 2, 3, 5 or 11, and up to isomorphism, there are only nine such graphs: one for each p = 2, 3 ...
متن کاملA note on large Cayley graphs of diameter two and given degree
Let ) 2 , (d C , ) 2 , (d AC , and ) 2 , (d CC be the largest order of a Cayley graph of a group, an Abelian group, and a cyclic group, respectively, of diameter 2 and degree d. The currently known best lower bounds on these parameters are 2 / ) 1 ( ) 2 , ( 2 d d C for degrees 1 2 q d where q is an odd prime power, ) 4 )( 8 / 3 ( ) 2 , ( 2 d d AC where 2 4 q d for an odd prime p...
متن کاملFree Actions Of
Let p be an odd regular prime, and let G p denote the extraspecial p–group of order p 3 and exponent p. We show that G p acts freely and smoothly on S 2p−1 ×S 2p−1. For p = 3 we explicitly construct a free smooth action of a Lie group G 3 containing G 3 on S 5 × S 5. In addition, we show that any finite odd order subgroup of the exceptional Lie group G 2 admits a free smooth action on S 11 × S ...
متن کاملArc-transitive Pentavalent Graphs of Order 4pq
This paper determines all arc-transitive pentavalent graphs of order 4pq, where q > p > 5 are primes. The cases p = 1, 2, 3 and p = q is a prime have been treated previously by Hua et al. [Pentavalent symmetric graphs of order 2pq, Discrete Math. 311 (2011), 2259-2267], Hua and Feng [Pentavalent symmetric graphs of order 8p, J. Beijing Jiaotong University 35 (2011), 132-135], Guo et al. [Pentav...
متن کاملOn (Semi-) Edge-primality of Graphs
Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an ...
متن کامل